Time-Efficient Quantum Walks for 3-Distinctness
نویسندگان
چکیده
We present two quantum walk algorithms for 3-Distinctness. Both algorithms have time complexity Õ(n), improving the previous Õ(n) and matching the best known upper bound for query complexity (obtained via learning graphs) up to log factors. The first algorithm is based on a connection between quantum walks and electric networks. The second algorithm uses an extension of the quantum walk search framework that facilitates quantum walks with nested updates.
منابع مشابه
A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
We present an extension to the quantum walk search framework that facilitates quantum walks with nested updates. We apply it to give a quantum walk algorithm for 3-Distinctness with query complexity Õ(n), matching the best known upper bound (obtained via learning graphs) up to log factors. Furthermore, our algorithm has time complexity Õ(n), improving the previous Õ(n).
متن کاملOn the relationship between continuous- and discrete-time quantum walk
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or discrete time. But whereas a continuous-time random walk can be obtained as the limit of a sequence of discretetime random walks, the two types of quantum w...
متن کاملScattering theory and discrete-time quantum walks
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each, and consider walks that proceed from one half line, through the graph, to the other. The probability of starting on one line and reaching the other after n steps can be expressed in terms of the transmission amplitude for the g...
متن کاملQuantum Walk Based Search Algorithms
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum analogues of classical search procedures. We present a rather detailed description of a somewhat simplified version of the MNRS algorithm. Finally, in the que...
متن کاملDecoherence in Quantum Walks on the Hypercube
The notion of a quantum random walk has emerged as an important element in the development of efficient quantum algorithms. In particular, it makes a dramatic appearance in the most efficient known algorithm for element distinctness [1]. The technique has also been applied to offer simple separations between quantum and classical query complexity [5]. The basic model has two natural variants, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013